Chebyshev Inequality based Approach to Chance Constrained Portfolio Optimization

نویسنده

  • KIYOHARU TAGAWA
چکیده

A new approach to solve Chance constrained Portfolio Optimization Problems (CPOPs) without using the Monte Carlo simulation is proposed. Specifically, according to Chebyshev inequality, the prediction interval of a stochastic function value included in CPOP is estimated from a set of samples. By using the prediction interval, CPOP is transformed into Lower-bound Portfolio Optimization Problem (LPOP). It is proved that the feasible solution of LPOP is also feasible for CPOP. Furthermore, in order to solve LPOP, Differential Evolution (DE) is used. Finally, through a numerical experiment, the usefulness of the proposed approach is demonstrated. Key–Words: Portfolio Optimization, Risk Management, Chance Constraint, Chebyshev Inequality

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stock Portfolio-Optimization Model by Mean-Semi-Variance Approach Using of Firefly Algorithm and Imperialist Competitive Algorithm

Selecting approaches with appropriate accuracy and suitable speed for the purpose of making decision is one of the managers’ challenges. Also investing decision is one of the main decisions of managers and it can be referred to securities transaction in financial markets which is one of the investments approaches. When some assets and barriers of real world have been considered, optimization of...

متن کامل

A Robust Knapsack Based Constrained Portfolio Optimization

Many portfolio optimization problems deal with allocation of assets which carry a relatively high market price. Therefore, it is necessary to determine the integer value of assets when we deal with portfolio optimization. In addition, one of the main concerns with most portfolio optimization is associated with the type of constraints considered in different models. In many cases, the resulted p...

متن کامل

Robustness-based portfolio optimization under epistemic uncertainty

In this paper, we propose formulations and algorithms for robust portfolio optimization under both aleatory uncertainty (i.e., natural variability) and epistemic uncertainty (i.e., imprecise probabilistic information) arising from interval data. Epistemic uncertainty is represented using two approaches: (1) moment bounding approach and (2) likelihood-based approach. This paper first proposes a ...

متن کامل

Estimating the Parameters in Photovoltaic Modules: A Constrained Optimization Approach

This paper presents a novel identification technique for estimation of unknown parameters in photovoltaic (PV) systems. A single diode model is considered for the PV system, which consists of five unknown parameters. Using information of standard test condition (STC), three unknown parameters are written as functions of the other two parameters in a reduced model. An objective function and ...

متن کامل

Multiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems

Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017